Constructions of universalized Sierpiński graphs based on labeling manipulations

نویسنده

  • Toru Hasunuma
چکیده

Sierpiński graphs are known to be graphs with self-similar structures, and their various properties have been investigated until now. Besides, they are known to be isomorphic to WK-recursive networks which have been proposed as interconnection networks because of their nice extendability. As a generalization (resp., variant) of Sierpiński graphs, generalized Sierpiński graphs (resp., extended Sierpiński graphs) have been introduced. In this talk, we newly define a larger graph class which includes both generalized Sierpiński graphs and extended Sierpiński graphs, and moreover uneven graphs with self-similar structures such as Fobonacci trees. Let G be a simple undirected graph which may have a self-loop. The universalized Sierpiński graph Υ(G, n) is defined to be the graph with the vertex set consisting of all n-tuple (v1, v2, . . . , vn) where vi ∈ V (G) for 1 ≤ i ≤ n and vi 6= vi+1 if vi has no self-loop, and in which two vertices (u1, u2, . . . , un) and (v1, v2, . . . , vn) are adjacent if and only if there exists an integer j such that ui = vi for 1 ≤ i < j, ujvj ∈ E(G), and uj+` = vj, vj+` = uj for 1 ≤ ` ≤ n − j if both u and v have a self-loop, uj+` = vj, vj+` = uj (resp., uj+` = uj, vj+` = vj) for odd (resp., even) 1 ≤ ` ≤ n − j otherwise. In particular, when G is a compete graph with a self-loop at each vertex, Υ(G, n) is a Sierpiński graph. Besides, if every vertex of G has a self-loop (resp., G is a complete graph), then Υ(G, n) corresponds to a generalized Sierpiński graph (resp., extended Sierpiński graph). To construct Υ(G, n) based on the definition, we need to combine |V (G)| copies of subgraphs of Υ(G, n − 1). We then present an inductive algorithm whose essential parts consist of edge-labelings and vertex-labelings, to construct Υ(G, n) from the original graph G. An advantage of such an algorithmic construction of Υ(G, n) is to be able to investigate the structure of Υ(G, n) directly from that of Υ(G, n−1). We also present structural properties of universalized Sierpński graphs such as connectivity, vertex-colorings, edge-colorings, total colorings, hamiltonicity, and factorizations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructions of antimagic labelings for some families of regular graphs

In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.

متن کامل

Coloring Sierpiński graphs and Sierpiński gasket graphs

Sierpiński graphs S(n, 3) are the graphs of the Tower of Hanoi with n disks, while Sierpiński gasket graphs Sn are the graphs naturally defined by the finite number of iterations that lead to the Sierpiński gasket. An explicit labeling of the vertices of Sn is introduced. It is proved that Sn is uniquely 3-colorable, that S(n, 3) is uniquely 3-edgecolorable, and that χ′(Sn) = 4, thus answering ...

متن کامل

Equitable L(2, 1)-labelings of Sierpiński graphs

An L(2, 1)-labeling of a graph G is equitable if the number of elements in any two color classes differ by at most one. The equitable L(2, 1)-labeling number λe(G) of G is the smallest integer k such that G has an equitable L(2, 1)-labeling. Sierpiński graphs S(n, k) generalize the Tower of Hanoi graphs—the graph S(n, 3) is isomorphic to the graph of the Tower of Hanoi with n disks. In this pap...

متن کامل

Codes and L(2, 1)-labelings in Sierpiński Graphs

The λ-number of a graph G is the minimum value λ such that G admits a labeling with labels from {0, 1, . . . , λ} where vertices at distance two get different labels and adjacent vertices get labels that are at least two apart. Sierpiński graphs S(n, k) generalize the Tower of Hanoi graphs—the graph S(n, 3) is isomorphic to the graph of the Tower of Hanoi with n disks. It is proved that for any...

متن کامل

Consensus in Self-similar Hierarchical Graphs and Sierpiński Graphs: Convergence Speed, Delay Robustness, and Coherence

The hierarchical graphs and Sierpiński graphs are constructed iteratively, which have the same number of vertices and edges at any iteration, but exhibit quite different structural properties: the hierarchical graphs are non-fractal and smallworld, while the Sierpiński graphs are fractal and “large-world”. Both graphs have found broad applications. In this paper, we study consensus problems in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electronic Notes in Discrete Mathematics

دوره 60  شماره 

صفحات  -

تاریخ انتشار 2017